Improved Algorithm for Degree Bounded Survivable Network Design Problem
نویسندگان
چکیده
We consider the Degree-Bounded Survivable Network Design Problem: the objective is to find a minimum cost subgraph satisfying the given connectivity requirements as well as the degree bounds on the vertices. If we denote the upper bound on the degree of a vertex v by b(v), then we present an algorithm that finds a solution whose cost is at most twice the cost of the optimal solution while the degree of a degree constrained vertex v is at most 2b(v) + 2. This improves upon the results of Lau and Singh [13] and Lau, Naor, Salavatipour and Singh [12].
منابع مشابه
Survivable Network Design with Degree or Order
We present algorithmic and hardness results for network design problems with degree or order constraints. The first problem we consider is the Survivable Network Design problem with degree constraints on vertices. The objective is to find a minimum cost subgraph which satisfies connectivity requirements between vertices and also degree upper bounds Bv on the vertices. This includes the well-stu...
متن کاملA Unified Algorithm for Degree Bounded Survivable Network Design
We present an approximation algorithm for the minimum bounded degree Steiner network problem that returns a Steiner network of cost at most two times the optimal and the degree on each vertex v is at most min{bv + 3rmax, 2bv + 2}, where rmax is the maximum connectivity requirement and bv is the given degree bound on v. This unifies, simplifies, and improves the previous results for this problem.
متن کاملIterative Rounding and Relaxation
In this survey paper we present an iterative method to analyze linear programming formulations for combinatorial optimization problems. This method is introduced by Jain to give a 2-approximation algorithm for the survivable network design problem. First we will present Jain’s method and the necessary background including the uncrossing technique in Section 2. Then we extend the iterative metho...
متن کاملA Fast Strategy to Find Solution for Survivable Multicommodity Network
This paper proposes an immediately efficient method, based on Benders Decomposition (BD), for solving the survivable capacitated network design problem. This problem involves selecting a set of arcs for building a survivable network at a minimum cost and within a satisfied flow. The system is subject to failure and capacity restriction. To solve this problem, the BD was initially proposed with ...
متن کاملSurvivable minimum bottleneck networks
We show that the survivable bottleneck Steiner tree problem in normed planes can be solved in polynomial time when the number of Steiner points is constant. This is a fundamental problem in wireless ad-hoc network design where the objective is to design networks with efficient routing topologies. Our result holds for a general definition of survivability and for any norm whose ball is specified...
متن کامل